Efficient Implementation for Deterministic Finite Tree Automata Minimization
نویسندگان
چکیده
منابع مشابه
Efficient Implementation for Deterministic Finite Tree Automata Minimization
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized. We show that the asymptotic complexity of the standard implementation is linearithmic and the incremental one is O(n3 log(n)) where n is the DFT...
متن کاملAn Implementation of Deterministic Tree Automata Minimization
A frontier-to-root deterministic finite-state tree automaton (DTA) can be used as a compact data structure to store collections of unranked ordered trees. DTAs are usually sparser than string automata, as most transitions are undefined and therefore, special care must be taken in order to minimize them efficiently. However, it is difficult to find simple and detailed descriptions of the minimiz...
متن کاملHyper-Minimization for Deterministic Weighted Tree Automata
Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided. The presence of weights slightly complicates the situation in comparison to the unweighted case. In addition, the first hyper-minimization algorithm for deterministic weighted tree automata, weighted over commutati...
متن کاملHyper-minimization for Deterministic Tree Automata
Hyper-minimization aims to reduce the size of the representation of a language beyond the limits imposed by classical minimization. To this end, the hyper-minimal representation can represent a language that has a finite difference to the original language. The first hyperminimization algorithm is presented for (bottom-up) deterministic tree automata, which represent the recognizable tree langu...
متن کاملEfficient Deterministic Finite Automata Minimization Based on Backward Depth Information
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2016
ISSN: 1330-1136,1846-3908
DOI: 10.20532/cit.2016.1002867